A bi-objective integer programming model for partly-restricted flight departure scheduling
نویسندگان
چکیده
منابع مشابه
A two-stage approach for bi-objective integer linear programming
We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...
متن کاملA multi objective mixed integer programming model for design of a sustainable meat supply chain network
In the recent decades, rapid population growth has led to the significant increase in food demand. Food supply chain has always been one of the most important and challenging management issues. Product with short age, especially foodstuffs, is the most problematic challenges for supply chain management. These challenges are mainly due to the diversity in the number of these goods, the special n...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA nonlinear multi objective model for the product portfolio optimization: An integer programming
Optimization of the product portfolio has been recognized as a critical problem in industry, management, economy and so on. It aims at the selection of an optimal mix of the products to offer in the target market. As a probability function, reliability is an essential objective of the problem which linear models often fail to evaluate it. Here, we develop a multiobjective integer nonlinear cons...
متن کاملBranch-and-bound for bi-objective integer programming
In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0196146